Representation and generation of graphs using iterated function systems
نویسندگان
چکیده
منابع مشابه
Iterated Function Systems and Two-Dimensional Shape Representation
A fundamental requirement of any vision system designed to perform recognition tasks is a library of representations of objects it is likely to encounter. The classic approach to constructing such representations is to decompose the shape into simple primitive elements. However, for complex shapes it is usually necessary to use a large number of such primitives to achieve an accurate decomposit...
متن کاملcoordination of protective schemes in distribution and subtransmission systems including distributed generation
نصب منابع پراکنده در سیستم های توزیع و فوق توزیع علاوه بر مزیت های فراوان، مشکلاتی را هم به همراه دارد. یکی از این مشکلات تأثیر این منابع روی اندازه جریان های اتصال کوتاه است. به طور معمول از حفاظت های مبتنی بر اصل جریان زیاد در سیستم های توزیع و فوق توزیع استفاده می شود. از مهمترین طرح های حفاظتی استفاده شده در فیدرهای توزیع، حفاظت فیوز- ریکلوزر است. همچنین از طرح های حفاظتی جریان زیاد جهتی در...
On the Relation between Iterated Function Systems and Partitioned Iterated Function Systems on the Relation between Iterated Function Systems and Partitioned Iterated Function Systems on the Relation between Iterated Function Systems and Partitioned Iterated Function Systems
In this paper, we give a theoretically founded transition from Iterated Function Systems based on aane transformations to Partitioned Iterated Function Systems. We show that there are two essential steps, namely, restricting the aane transformations, and solving the evoked problem of ink dissipation. In this paper, we give a theoretically founded transition from Iterated Function Systems based ...
متن کاملCreating Fractals using Iterated Function Systems
Suppose you had no ideas what fractals were, and you were asked to model objects like clouds, grass, plants, etc.. What else could you use to define the geometries of these objects? Although polynomials can easily define objects with smooth geometry, they are pretty useless if you want to model complex objects like grass or plants, since those possess infinitely non smooth, highly structured ge...
متن کاملD-Spectrum and D-Energy of Complements of Iterated Line Graphs of Regular Graphs
The D-eigenvalues {µ1,…,µp} of a graph G are the eigenvalues of its distance matrix D and form its D-spectrum. The D-energy, ED(G) of G is given by ED (G) =∑i=1p |µi|. Two non cospectral graphs with respect to D are said to be D-equi energetic if they have the same D-energy. In this paper we show that if G is an r-regular graph on p vertices with 2r ≤ p - 1, then the complements of iterated lin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematics Letters
سال: 1997
ISSN: 0893-9659
DOI: 10.1016/s0893-9659(97)00038-4